Orientations of the n-cube with minimum diameter
نویسندگان
چکیده
منابع مشابه
Minimum diameter and cycle-diameter orientations on planar graphs
Let G be an edge weighted undirected graph. For every pair of nodes consider the shortest cycle containing these nodes in G. The cycle diameter of G is the maximum length of a cycle in this set. Let H be a directed graph obtained by directing the edges of G. The cycle diameter of H is similarly defined except for that cycles are replaced by directed closed walks. Is there always an orientation ...
متن کاملParallel Chip Firing Game Associated with n- cube Edges Orientations
We study the cycles generated by the chip firing game associated with n-cube orientations. We consider a particular class of partitions of vertices of n-cubes called left cyclic partitions that induce parallel periodic evolutions. Using this combinatorical model, we show that cycles generated by parallel evolutions are of even lengths from 2 to 2 on Hn (n ≥ 1), and of odd lengths different from...
متن کاملParallel Chip Firing Game associated with n-cube orientations
We study the cycles generated by the chip firing game associated with n-cube orientations. We show the existence of the cycles generated by parallel evolutions of even lengths from 2 to 2n on Hn (n ≥ 1), and of odd lengths different from 3 and ranging from 1 to 2−1 on Hn (n ≥ 4).
متن کاملAlmost minimum diameter orientations of semicomplete multipartitite and extended digraphs
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6= y of vertices such that both xy and yx are in D. Almost minimum diameter orientations of certain semicomplete multipartite and extended digraphs are considered, several generalizations of results on orientations of undirected graphs are obtained, some conje...
متن کاملAlmost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6= y of vertices such that both xy and yx are in D. Almost minimum diameter orientations of certain semicomplete multipartite and extended digraphs are considered, several generalizations of results on orientations of undirected graphs are obtained, some conje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90123-9